Some Topological Methods in Graph Coloring Theory

نویسنده

  • Bojan Mohar
چکیده

Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology to graph coloring problems will be presented. In particular, the following subjects will be treated: The use of Euler’s formula and local planarity conditions, Kempe equivalence, homotopy, winding number and its higher dimensional analogues.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of Graph Theory to Some Thermodynamic Properties and Topological Indices

The relationship between the Randic , Wiener, Hosoya , Balaban, Schultz indices, Harary numbers andDistance matrix to enthalpies of formation (Airf), heat capacity, (Cp) , enthalpies of combustion (AH °c ),enthalpy of vaporization (AH °vap) and normal boiling points (bpK)of C2 C10 normal alkanes isrepresented

متن کامل

Application of Graph Theory: Relationship of Topological Indices with the Partition Coefficient (logP) of the Monocarboxylic Acids

It is well known that the chemical behavior of a compound is dependent upon the structure of itsmolecules. Quantitative structure – activity relationship (QSAR) studies and quantitative structure –property relationship (QSPR) studies are active areas of chemical research that focus on the nature ofthis dependency. Topological indices are the numerical value associated with chemical constitution...

متن کامل

The Structural Relationship Between Topological Indices and Some Thermodynamic Properties

The fact that the properties of a molecule are tightly connected to its structural  characteristics  is one of the fundamental concepts in chemistry. In this connection,  graph theory has been successfully applied in developing some relationships between topological indices and some thermodynamic properties. So ,  a novel method for computing the new descriptors to construct a quantitative rela...

متن کامل

الگوریتم ژنتیک با جهش آشوبی هوشمند و ترکیب چند‌نقطه‌ای مکاشفه‌ای برای حل مسئله رنگ‌آمیزی گراف

Graph coloring is a way of coloring the vertices of a graph such that no two adjacent vertices have the same color. Graph coloring problem (GCP) is about finding the smallest number of colors needed to color a given graph. The smallest number of colors needed to color a graph G, is called its chromatic number. GCP is a well-known NP-hard problems and, therefore, heuristic algorithms are usually...

متن کامل

Analysis of Resting-State fMRI Topological Graph Theory Properties in Methamphetamine Drug Users Applying Box-Counting Fractal Dimension

Introduction: Graph theoretical analysis of functional Magnetic Resonance Imaging (fMRI) data has provided new measures of mapping human brain in vivo. Of all methods to measure the functional connectivity between regions, Linear Correlation (LC) calculation of activity time series of the brain regions as a linear measure is considered the most ubiquitous one. The strength of the dependence obl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2000